Automated Higher-order Reasoning in Quantales
نویسنده
چکیده
We present an approach to bring reasoning in quantales into the realm of automated theorem proving. We use the TPTP Problem Library for this purpose which by a recent approach now integrates fully automated higher-order theorem provers. In particular, we give an encoding of quantales in the new typed higher-order form and show how to prove theorems about quantales fully automatically.
منابع مشابه
UNIVERSITÄT AUGSBURG Automated Higher-Order Reasoning in Quantales
Originally developed as an algebraic characterisation for quantum mechanics, the algebraic structure of quantales nowadays finds widespread applications ranging from (non-commutative) logics to hybrid systems. We present an approach to bring reasoning in quantales into the realm of (fully) automated theorem proving. Hence the paper paves the way for automatisation in various (new) fields of app...
متن کاملAutomated Higher-order Reasoning about Quantales
Originally developed as an algebraic characterisation for quantum mechanics, the algebraic structure of quantales nowadays finds widespread applications ranging from (non-commutative) logics to hybrid systems. We present an approach to bring reasoning about quantales into the realm of (fully) automated theorem proving. This will yield automation in various (new) fields of applications in the fu...
متن کاملAn Evaluation of Automated Theorem Proving in Regular Algebra
Introduction The Isabelle/HOL environment [8] combines the power of automated reasoning with higher-order features for theory engineering and proof management. Its built-in Sledgehammer tool integrates state of the art ATP and SMT tools, allowing for powerful automated reasoning in proofs [2]. Theory engineering features such as typeclasses and locales support the effective design of large theo...
متن کاملRelational Representation of Groupoid Quantales
In Palmigiano and Re (J Pure Appl Algebra 215(8):1945–1957, 2011), spatial SGF-quantales are axiomatically introduced and proved to be representable as sub unital involutive quantales of quantales arising from set groupoids. In the present paper, spatial SGF-quantales of this class are shown to be optimally representable as unital involutive quantales of relations. The results of the present pa...
متن کاملA Semiring Approach to Equivalences, Bisimulations and Control
Equivalences, partitions and (bi)simulations are usually tackled using concrete relations. There are only few treatments by abstract relation algebra or category theory. We give an approach based on the theory of semirings and quantales. This allows applying the results directly to structures such as path and tree algebras which is not as straightforward in the other approaches mentioned. Also,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009